Method and system for personalized advertisement push based on user interest learning

ABSTRACT

Embodiments of the present invention relate to a method and a system for personalized advertisement push based on user interest learning. The method may include: obtaining multiple user interest models through multitask sorting learning; extracting an object of interest in a video according to the user interest models; and extracting multiple visual features of the object of interest, and according to the visual features, retrieving related advertising information in an advertisement database. Through the method and the system provided in embodiments of the present invention, a push advertisement may be closely relevant to the content of the video, thereby meeting personalized requirements of a user to a certain extent and achieving personalized advertisement push.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Patent Application No. PCT/CN2010/079245, filed on Nov. 29, 2010, which is hereby incorporated by reference in its entirety.

FIELD OF THE INVENTION

The present invention relates to the field of image processing, and in particular, to a method and a system for personalized advertisement push based on user interest learning.

BACKGROUND OF THE INVENTION

In recent years, the number of videos on the Internet increases rapidly, and the existence of a huge number of videos significantly promotes the development of services, such as online video advertising. At present, multiple methods for associating videos with advertisements based on different rules are used in video websites and video playing software. Generally speaking, these methods mainly emphasize the push of predefined advertisements, including:

1) Advertisements inserted in time domains: As shown in FIG. 1( a), a piece of predefined advertisement is played at buffering at the beginning, pausing in the middle, or at an end of a video. Forms of the advertisements may be a picture or a video, and so on.

2) Advertisements associated on a periphery: As shown in FIG. 1( b), when a video is played, a predefined advertisement is displayed on the periphery of a video player (such as a web page, and a boarder of the player).

3) Partially overlapped advertisements: As shown in FIG. 1( c), a small advertisement (a picture or a simple FLASH) is overlapped on a part of the content of a video, and usually does not affect a main part of the video.

At present, the foregoing three advertisement push methods are all applied widely. However, the effect of the advertisement push is not good. For example, in the first method, when the advertisement is played, a user is usually in a state of browsing other web pages, thereby reducing an advertising effect; although the second method has relatively small interference, the advertisement is often ignored as a background of a web page; the third method affects normal viewing experience of the user to a certain extent. The main issue is that the foregoing push advertisements usually have a relatively low association degree with the contents and cannot meet personalized interest requirements of each user. Therefore, the effect of the advertisements is relatively poor.

SUMMARY OF THE INVENTION

Embodiments of the present invention provide a method and a system for personalized advertisement push based on user interest learning, so as to solve an existing problem that push advertisements have a low association degree with contents and cannot meet personalized interest requirements of each user.

An embodiment of the present invention provides a personalized advertisement push method based on user interest learning, including:

obtaining multiple user interest models through multitask sorting learning;

extracting an object of interest in a video according to the user interest models; and

extracting multiple visual features of the object of interest, and according to the visual features, retrieving related advertising information in an advertisement database.

An embodiment of the present invention further provides a personalized advertisement push system based on user interest learning, including:

an interest model learning module, configured to obtain multiple user interest models through multitask sorting learning;

an object of interest extraction module, configured to extract an object of interest in a video according to the user interest models; and

an advertisement retrieval module, configured to extract multiple visual features of the object of interest, and according to the visual features, retrieve related advertising information in an advertisement database.

It can be known from the foregoing technical solutions that, in the embodiments of the present invention, the user interest models are obtained by utilizing an algorithm of multitask sorting learning, and based on this, areas with a relatively high interest degree in the video are automatically extracted for different users, and then advertising information association is performed by using the areas with a relatively high interest degree. The advertisement provided in such manner is not only closely related to the contents of the video, but also meets the personalized requirements of the user to a certain extent, thereby achieving personalized advertisement push.

BRIEF DESCRIPTION OF THE DRAWINGS

To illustrate the technical solutions in the embodiments of the present invention or in the prior art more clearly, the accompanying drawings required for describing the embodiments or the prior art are introduced briefly in the following. Apparently, the accompanying drawings in the following description are only some embodiments of the present invention, and persons of ordinary skill in the art can further derive other implementation manners according to these accompanying drawings without creative efforts.

FIG. 1 is a schematic diagram of an existing advertisement push method;

FIG. 2 is a schematic flow chart of a personalized advertisement push method based on user interest learning according to an embodiment of the present invention;

FIG. 3 is a schematic flow chart of user interest model learning according to an embodiment of the present invention;

FIG. 4 is a schematic flow chart for extracting an object of interest in a video according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of interest degree distribution of a key frame obtained in a process for extracting an object of interest in a video according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of a personalized advertisement push system based on user interest learning according to an embodiment of the present invention;

FIG. 7 is a schematic diagram of data flowing based on the system shown in FIG. 6 according to an embodiment of the present invention;

FIG. 8 is a schematic diagram of an advertisement push effect generated by a method and a system according to an embodiment of the present invention.

DETAILED DESCRIPTION OF THE EMBODIMENTS

The specific embodiments of the present invention are further illustrated in detail in the following with reference to the accompanying drawings.

In an embodiment provided in the present invention, in a system according to a pre-collected scene set with various contents and interest feedback of a user to these scenes, a user interest model is obtained through training by adopting an algorithm of multitask sorting learning, and a scene classification and a user classification are obtained at the same time. Steps such as extraction of a bottom-layer visual feature of a scene, an initial random classification of scenes and users, and calculation of a parameter of an interest model are included. Then, the system detects a key frame when a video is played, classifies the scenes which correspond to the key frame according to a scene classification obtained in a model learning process, and calculates and generates an interest degree diagram according to the interest model of each user, respectively. At last, by utilizing an area growth method, an area with a relatively high interest degree is generated from the interest degree diagram and serves as an object of interest, and a related advertisement is retrieved in an advertising information database according to its multiple features, and at last a video stream with a personalized advertisement is output. Features of the object of interest reflect visual characteristics of the object at different angles and different levels, which include but are not limited to color, structure, outline, and texture feature. Preferentially, in the embodiments of the present invention, an HSV color histogram, a Gabor histogram, a SIFT histogram, and a video fingerprinting feature of the object of interest are extracted. Meanwhile, a retrieval method is a fast matching algorithm, and different matching methods are adopted for different features.

FIG. 2 is a schematic flow chart of a personalized advertisement push method based on user interest learning according to an embodiment of the present invention. As shown in FIG. 2, the embodiment may include the following steps:

Step 201: Interest model learning: obtain a plurality of user interest models through an algorithm of multitask sorting learning.

As shown in FIG. 3, this step further includes:

Step 2011: Obtain various scenes and interest feedback of a user to each scene.

Specifically, the scene may include subjects of multiple aspects, such as advertising, news, cartoon, and movie. The user may mark an object of interest in these scenes through simple interaction. Since points of interest of different users are different even in a same scene, the following manner may be used to represent a scene set, a user set and a relationship between them:

S={S₁, . . . S_(k), . . . S_(K)} represents a scene set including K scenes, where S_(k) indicates a k^(th) scene;

υ={U₁, . . . U_(m), . . . U_(M)} represents a user set including M users, where U_(m) indicates an m^(th) user;

The relationship between them is indicated by Θ={θ_(k) ^(m)∈{0, 1}}. When and only when the user U_(m) interacts with the scene S_(k) and marks the object of interest, θ_(k) ^(m)=1. It is assumed that the scene S_(k) is divided into a set of macroblocks

={s_(k1), s_(k2), s_(kn)}, with the relationship between the object of interest O_(k) ^(m) marked by the user U_(m) on the scene S_(k) and the macroblocks in the scene S_(k), another two-value set

={y_(ki) ^(m)∈{0, 1}} may be inferred, where when and only when an i^(th) macroblock s_(ki) in the scene S_(k) is a part of the object of interest O_(k) ^(m) marked by the user, y_(ki) ^(m)=1.

Step 2012: Extract bottom-layer visual features of each macroblock in each scene from local and global aspects.

Specifically, each scene is divided into a set of macroblocks, and bottom-layer visual features of each macroblock are calculated. A bottom-layer visual feature of a whole scene may be obtained by combining the bottom-layer visual features of the macroblocks of this scene. In an embodiment, a scene may be divided into macroblocks in a size of 16 pels×16 pels, and a local contrast feature in a multi-scale and multi-vision channel may be extracted as the bottom-layer visual features of each macroblock. Meanwhile, by calculating a difference of multiple visual statistical characteristics between a macroblock and the whole scene where the macroblock is located, a global visual feature of the macroblock is obtained.

For the macroblock S_(ki), it is assumed that x_(ki) represents its feature vector, and then for a scene S_(k), χ_(k)={x_(k1), x_(k2), . . . x_(kn)} represents a set of feature vectors of all its macroblocks. By utilizing the set χ_(k), a feature vector ν_(k) of the whole scene S_(k) and a feature vector ν _(k) ^(m) of the object of interest are obtained through certain combination transformation. In an embodiment, ν_(k) is defined as an expected value and a standard deviation of the feature vector of each macroblock in the scene, and ν _(k) ^(m) is defined as an expected value and a standard deviation of the feature vector of each macroblock in the object of interest. Therefore, the task for training a user interest model changes to finding a model (or a function) φ: χ->

and according to the feature vector x_(ki) of different macroblocks S_(ki) in the scene S_(k), this model can assign different real values to the feature vector x_(ki). And then, the real values are sorted. It is assumed that a sorting result is π_(k) (Φ)={Φ(x_(k1)), Φ(x_(k2)), . . . Φ(x_(kn))} and then a final aim is to decrease a difference between the sorting result π_(k) (Φ) output by the model and a sorting result γ_(m) ^(k) fed back by the user.

Step 2013: Perform initial classification on scenes and users at random.

Specifically, the initial classification may be performed by randomly classifying the scenes and the users. Another visualized method is to perform initial classification on scenes and users according to similarity of the contents of the scenes and similarity of the user interest feedback, respectively. In this embodiment, the scene content similarity is calculated through the scene feature v_(k) obtained in step 302, and the user interest similarity is calculated through the feature v _(k) ^(m) of the object of interest chosen by each user. Results of the initial classification is indicated by α={α_(ki)∈{0, 1}} and β={β_(mj)∈{0, 1}}, where when and only when S_(k) is an i^(th) kind of scenes, α_(ki)=1, and when and only when U_(m) is a j^(th) kind of users, β_(mj)=1.

Step 2014: According to the classification results of the scenes and the users, initialize a plurality of user interest models.

Specifically, an objective function to be optimized needs to be constructed first before the user interest models are initialized. The objective function is divided into two parts, and in this embodiment, it is formalized as:

${{\min\limits_{w,\alpha,\beta}{\mathcal{L}\left( {W,\alpha,\beta} \right)}} + {\lambda \; {\Omega \left( {W,\alpha,\beta} \right)}}},{{s.t.\mspace{20mu} {\sum\limits_{i \in I}\alpha_{ki}}} = 1},{\alpha_{ki} \in \left\{ {0,1} \right\}},{{for}\mspace{14mu} {any}\mspace{14mu} k},{{\sum\limits_{j \in J}\beta_{mj}} = 1},{\beta_{mj} \in \left\{ {0,1} \right\}},{{for}\mspace{14mu} {any}\mspace{14mu} m},$

where

is a set of parameters of the interest model, I is a set of scene classifications,

is a set of user classifications,

(

, α, β) is an experience loss, Ω(

, α, β) is a penalty loss of

which is determined according to prior knowledge. If it is assumed that l(π_(k)(φ_(ij)), γ_(m) ^(k)) indicates a difference between an interest degree diagram which is predicated according to the user interest model φ_(ij) in the scene S_(k) and an actual interest degree diagram of the user U_(m), then the experience loss may be defined as:

${\mathcal{L}\left( {W,\alpha,\beta} \right)} = {\sum\limits_{i \in I}{\sum\limits_{j \in J}{\sum\limits_{m = 1}^{M}{\sum\limits_{k = 1}^{K}{\theta_{k}^{m}\alpha_{ki}\beta_{mj}{l\left( {{\pi_{k}\left( \varphi_{ij} \right)},\gamma_{m}^{k}} \right)}}}}}}$

In an embodiment, l(π_(k)(φ_(ij)), γ_(m) ^(k)) may be defined as:

${l\left( {{\pi_{k}\left( \varphi_{ij} \right)},Y_{k}^{m}} \right)} = {\sum\limits_{n_{0} \neq n_{1}}^{N}{\left\lbrack {y_{{kn}_{0}}^{m} < y_{{kn}_{1}}^{m}} \right\rbrack_{I} \cdot \left\lbrack {{{\overset{\_}{w}}_{ij}^{T}x_{{kn}_{1}}} \leq {{\overset{\_}{w}}_{ij}^{T}x_{{kn}_{0}}}} \right\rbrack_{I}}}$

where φ_(ij)(x)= ω _(ij) ^(T)x is a linear user interest model, and ω _(ij) its parameter vector. In the foregoing formula, if an event x is true, [x]_(I)=1; otherwise, [x]_(I)=0. Meanwhile, the penalty loss Ω(ω, α, β) is a sum of four penalty items which are set based on prior knowledge. That is:

Ω(

,α,β)=ε_(s)Ω_(s)+ε_(u)Ω_(u)+ε_(d)Ω_(d)+ε_(c)Ω_(c)

In the foregoing formula, four weighting coefficients c_(s), c_(o), E_(d), c_(c) are set according to an effect on a verification data set. Ω_(s) refers to scene classification penalty, which is mainly used to calculate a difference of feature vectors v_(k) between scenes. When two scenes have the same content but are in different scene classifications, this penalty value is rather great. In an embodiment, the scene classification penalty is defined as:

$\Omega_{s} = {\sum\limits_{k_{0} < k_{1}}^{K}{\sum\limits_{i \in I}{\left( {\alpha_{k_{0}i} - \alpha_{k_{1}i}} \right)^{2}\left\lbrack {\cos \left( {v_{k_{0}},v_{k_{1}}} \right)} \right\rbrack}_{+}}}$

where cos(v_(k) ₀ , v_(k) ₁ ) indicates a cosine distance between scene feature vectors v_(k) ₀ and v_(k) ₁ , and [x]+ indicates max(0, x).

Ω_(u) refers to user classification penalty, which is mainly used to calculate a difference of features ν _(k) ^(m) of objects of interest chosen by users. When users with a same preference are classified into different classifications, the penalty value becomes greater. In an embodiment, the user classification penalty is defined as:

$\Omega_{u} = {\overset{M}{\sum\limits_{m_{0} < m_{1}}}{\sum\limits_{j \in J}{\left( {\beta_{m_{0}j} - \beta_{m_{1}j}} \right)^{2}\delta_{m_{0}m_{1}}}}}$

where δ_(m) ₀ _(m) ₁ similarity between users m₀ and m₁ and is defined as:

$\delta_{m_{0}m_{1}} = {\frac{1}{Z_{m_{0}m_{1}}}{\sum\limits_{k_{0} = 1}^{K}{\sum\limits_{k_{1} = 1}^{K}{\theta_{k_{0}}^{m_{0}}{\theta_{k_{1}}^{m_{1}} \cdot {\left\lbrack {{\cos \left( {v_{k_{0}},v_{k_{1}}} \right)} > T_{s}} \right\rbrack_{I}\left\lbrack {{\cos \left( {{\overset{\_}{v}}_{k_{0}}^{m_{0}},{\overset{\_}{v}}_{k_{1}}^{m_{1}}} \right)} > T_{s}} \right\rbrack}_{I}}}}}}$

In the foregoing formula, T_(s) is a predefined threshold value; Z_(m) ₀ _(m) ₁ is a constant which is used to normalize δ_(m) ₀ _(m) ₁ into a range of [0,1].

Ω_(d) refers to model difference penalty, which is mainly used to calculate a predicated loss of different models in different conditions, and different classifications of user models are encouraged to give different predictions. This is because a same classification of user models also has different predictions in different scene classifications. In an embodiment, the user cluster penalty is defined as:

$\Omega_{d} = {{\sum\limits_{i \in I}{\sum\limits_{j_{0} < j_{1}}^{J}{\sum\limits_{k = 1}^{K}{l\left( {{\pi_{k}\left( \varphi_{{ij}_{0}} \right)},{- {\pi_{k}\left( \varphi_{{ij}_{1}} \right)}}} \right)}}}} + {\sum\limits_{j \in J}{\sum\limits_{i_{0} < i_{1}}^{I}{\sum\limits_{k = 1}^{K}{l\left( {{\pi_{k}\left( \varphi_{i_{0}j} \right)},{- {\pi_{k}\left( \varphi_{i_{1}j} \right)}}} \right)}}}}}$

Ω_(c) refers to model complexity penalty which may be obtained by calculating a sum of norms of a model parameter. When an adopted model is complex, this part is relatively great. In an embodiment, the model complexity penalty is defined as:

$\Omega_{c} = {\sum\limits_{i \in I}{\sum\limits_{i \in J}{{\overset{\_}{w}}_{ij}}_{2}^{2}}}$

During a model update process, the penalty item may be used to control the number of classifications of users and scenes, so that generating too complex models can be avoided.

Step 2015: Update scene classification and user classification in sequence on the basis of obtained user interest models.

Step 2016: According to new classification results of scenes and users, train again to obtain a plurality of new user interest models.

Step 2017: Judge whether the predefined number of iteration times is reached, or the objective function is small to a certain value. If yes, execute step 2018; if no, return to step 2015.

Step 2018: Take the user interest models and classifications of scenes and users which are obtained through the last iteration as final user interest models and classifications of scenes and users.

It should be noted that a basis for initially calculating the interest model in step 2014 is to decrease the experience loss as far as possible. In step 2015, the update of classifications of scenes and users is performed on the basis of the obtained user interest models. For example, scene cluster update may be performed according to decreasing errors of model predictions and increasing the content similarity between scenes, and user cluster update may be performed according to a known interest model and increasing the preference similarity between users. Then, new user interest models are calculated again according to newly-obtained classifications of scenes and users. Repeat steps of the iteration and the update until defined conditions are satisfied (the defined number of times is reached, or the value of the objective function is small to a certain extent). After step 2018, the obtained classifications of scenes and users and the user interest models are taken as a basis for subsequent multitask extraction of the object of interest.

Step 202: Extract an object of interest: extract the object of interest in a video according to the user interest models.

As shown in FIG. 4, the step further includes:

Step 2021: Detect a representative key frame in a video stream as a key scene.

Specifically, similarity among all frames in a video shot is calculated, and a frame which is most similar to another frame is found and taken as the representative key frame.

Step 2022: Extract bottom-layer visual features of each macroblock in a current scene, and calculate out a whole bottom-layer visual feature of the scene.

Specifically, by using the same bottom-layer visual feature as those in the process of the interest model learning, the bottom-layer visual features of each macroblock in the current scene are extracted first, and then the whole bottom-layer visual feature of the scene is calculated. In this embodiment, the expected values and the standard deviation of features of each macroblock are taken as a whole feature of the scene.

Step 2023: Classify scenes according to the whole bottom-layer visual feature.

Specifically, the whole bottom-layer visual feature obtained in step 2022 is taken as a basis for classifying the scene, and the most approximate classification is chosen among known scene classifications. Preferentially, a support vector machine may be trained to perform the classification work. Under the premise that the current user classification and scene classification are known, the interest degree of each macroblock in the scene may be sorted by utilizing the known user interest models.

Step 2024: Sort the interest degree of each macroblock in the scene, according to the user interest models.

Step 2025: Map a sorting result to an interest degree of each candidate block to obtain interest degree distribution of the scene.

Specifically, perform mapping on the sorting result in step 2024 so as to convert it to a numerical value range that facilitates indication of an interest degree diagram, for example, converting it to a decimal in a range of [0,1]. In an embodiment, sorted serial numbers C_(n)∈{0, . . . N−1} are mapped, and the mapping work is performed by adopting a quadruplicate function

$\left( \frac{N - {Cn} - 1}{N - 1} \right)^{4}$

with a value range of [0,1]. According to this, the interest degree diagram of the scene is obtained, as shown in FIG. 5.

Step 2026: Choose a candidate block with the highest global interest degree.

Step 2027: Generate an area with a relatively high interest degree by using an area growth algorithm.

It should be noted that, in this step, the algorithm which is used to generate the area with a relatively high interest degree is not limited to the area growth algorithm, and may also be another algorithm.

Step 2028: Obtain the object of interest according to the area with a relatively high interest degree.

By executing the foregoing steps, an object that the user is interested in is extracted from the video.

Step 203: Retrieve an associated advertisement: extract multiple visual features of the object of interest, and according to these features, retrieve related advertising information in an advertisement database.

In the personalized advertisement push method that is based on user interest learning and is provided in the embodiment of the present invention, the user interest models are obtained by utilizing the multitask sorting learning algorithm, and based on this, areas with a relatively high interest degree in the video are automatically extracted for different users, and then advertising information association is performed by using the areas with a relatively high interest degree. An advertisement provided in such manner is not only closely related to the contents of the video, but also meets the preference of users to a certain extent, thereby realizing the personalized advertisement push.

As shown in FIG. 6, an embodiment of the present invention further provides a personalized advertisement push system based on user interest learning, where the system includes an interest model learning module 61, an object of interest extraction module 62, and an advertisement retrieval module 63. The interest model learning module 61 is configured to obtain multiple user interest models through multitask sorting learning; the object of interest extraction module 62 is configured to extract an object of interest in a video according to the user interest models; the advertisement retrieval module 63 is configured to extract multiple visual features of the object of interest, and according to the visual features, retrieve related advertising information in an advertisement database.

Further, the interest model learning module 61 may further include the following submodules:

a feature extraction submodule 611, configured to obtain various scenes in training data and extract bottom-layer visual features of each macroblock in each scene;

an initialization submodule 612, configured to, according to the bottom-layer visual features, randomly group users and scenes into multiple classifications, respectively, and initialize an interest model for each classification of users on each classification of scenes;

an optimization submodule 613, configured to use an initialized interest model on a training set to establish a loss function which is taken as an optimization target, minimize the loss function through an optimization algorithm, and then update a parameter value of each interest model and optimize cluster classifications of users and scenes; and

a result obtaining submodule 614, configured to obtain final clusters of users and scenes, and multiple user interest models.

Further, the object of interest extraction module 62 may further include the following submodules:

a key frame detection submodule 621, configured to receive an input video stream and detect a representative key frame in a content of the video stream;

a feature calculation submodule 622, configured to, for each key frame, according to bottom-layer visual features of its macroblocks, calculate out a whole visual feature of a scene which corresponds to the key frame;

a scene classification submodule 623, configured to, according to the whole visual feature, classify the scene which corresponds to the key frame into one of scene classifications which are classified in an establishing process of user interest models;

an interest degree calculation submodule 624, configured to, according to the user interest models, calculate an interest degree distribution diagram of the scene where the key frame is located; and

an area growth submodule 625, configured to, on the interest degree distribution diagram through an area growth algorithm, obtain an area with the highest interest degree as the object of interest.

FIG. 7 is a schematic diagram of data flowing among each module in the personalized advertisement push system based on user interest learning according to the embodiment of the present invention, so as to further describe a connection relationship among each module in the personalized advertisement push system based on user interest learning provided in the embodiment of the present invention. As shown in FIG. 7:

In a process of user interest learning, a predefined scene set and a user interest feedback data stream first enter the feature extraction submodule 611, and the feature extraction submodule 611 inputs user interest feedback and a certain type of bottom-layer visual features that are obtained through extraction together into the initialization submodule 612; the initialization submodule 612 classifies users and scenes randomly, and initializes an original user interest model according to a classification result to obtain initial and random classifications of scenes and users, and interest models, and then sends these results to the optimization submodule 613; optimization is performed through an iteration algorithm, so as to update parameters of the interest models and update classifications of users and scenes; after preset conditions are reached, the result obtaining submodule 614 obtains a final user classification result and a final scene classification result and corresponding user interest models from the last iteration result. In a personalized advertisement push process, the key frame detection submodule 621 receives an input video stream, detects a representative key frame in a content, and outputs the key frame to the feature calculation submodule 622 which calculates a whole bottom-layer visual feature of the scene which corresponds to the key frame; a calculated feature data stream accompanying information provided by the result obtaining submodule 614 pass through the scene classification submodule 623 and the interest degree calculation submodule 624 to generate an interest degree distribution diagram of the scene where the key frame is located; and then, the area growth submodule 625 outputs an object of interest to an advertisement retrieval module 63 according to the interest degree distribution diagram, and finally outputs a video stream with a personalized advertisement after extracting multiple visual features and retrieving an advertising information database.

In the personalized advertisement push system based on user interest learning provided in the embodiment of the present invention, user interest models are obtained by utilizing a multitask sorting learning algorithm, and based on this, areas with a relatively high interest degree in the video are automatically extracted for different users, and then advertising information association is performed by using the areas with a relatively high interest degree. An advertisement provided in such manner is not only closely related to the content of the video, but also meets preference of users to a certain extent, thereby realizing the personalized advertisement push.

An advertisement push result generated by the method and the system according to the embodiments of the present invention is shown in FIG. 8.

Those of ordinary skill in the art may understand that all or a part of the steps of the method according to the embodiments may be implemented by a program instructing relevant hardware. The program may be stored in a computer readable storage medium. When the program runs, the steps of the foregoing method embodiments are executed. The storage medium may include any medium that is capable of storing program codes, such as a ROM, a RAM, a magnetic disk, or a compact disk.

Finally, it should be noted that the foregoing embodiments are merely used for describing the technical solutions of the present invention, but not intended to limit the present invention. It should be understood by persons of ordinary skill in the art that although the present invention has been described in detail with reference to the foregoing embodiments, modifications can still be made to the technical solutions recorded in each foregoing embodiment, or equivalent replacements can be made to some technical features in the technical solutions, as long as these modifications or replacements do not cause the essence of corresponding technical solutions to depart from the spirit and scope of the technical solutions of each embodiment in the present invention. 

What is claimed is:
 1. A personalized advertisement push method based on user interest learning, wherein the method comprises: obtaining a plurality of user interest models through multitask sorting learning; extracting an object of interest in a video according to the user interest models; and extracting multiple visual features of the object of interest, and retrieving related advertising information in an advertisement database according to the multiple visual features.
 2. The personalized advertisement push method based on user interest learning according to claim 1, wherein obtaining a plurality of user interest models through multitask sorting learning comprises: obtaining various scenes, and extracting bottom-layer visual features of each macroblock in each scene; and performing classification on users and classification on scenes according to the bottom-layer visual features through an algorithm of multitask sorting learning, and establishing the user interest models for each classification of users on each classification of scenes.
 3. The personalized advertisement push method based on user interest learning according to claim 2, wherein extracting bottom-layer visual features of each macroblock in each scene comprises extracting the bottom-layer visual features of each macroblock in each scene in a multi-scale and multi-vision channel.
 4. The personalized advertisement push method based on user interest learning according to claim 3, wherein the bottom-layer visual features comprise a local feature and a global feature.
 5. The personalized advertisement push method based on user interest learning according to claim 4, wherein the local feature is obtained by calculating a difference of multiple visual characteristics between the macroblock and its surrounding macroblocks, and the global feature is obtained by calculating a difference of multiple visual statistical characteristics between the macroblock and a whole scene where the macroblock is located.
 6. The personalized advertisement push method based on user interest learning according to claim 2, wherein performing classification on users and classification on scenes according to the bottom-layer visual features through an algorithm of multitask sorting learning, and the establishing the interest models for each classification of users on each classification of scenes comprises: randomly grouping the users and the scenes into multiple classifications respectively, and initializing an interest model for each classification of users on each classification of scenes; establishing a loss function on a training set by using an initialized interest model; minimizing the loss function through an optimization algorithm, and updating a parameter value of each interest model, and optimizing classifications of the users and the scenes; and obtaining final classifications of users and scenes, and a plurality of user interest models.
 7. The personalized advertisement push method based on user interest learning according to claim 6, wherein the loss function comprises an experience loss and a penalty loss.
 8. The personalized advertisement push method based on user interest learning according to claim 7, wherein the experience loss comprises a difference between a function value of the bottom-layer visual features of each macroblock in each scene under the user interest model and an interest value corresponding to the scene fed back by the users.
 9. The personalized advertisement push method based on user interest learning according to claim 7, wherein the penalty loss comprises scene classification penalty, user classification penalty, model difference penalty, and model complexity penalty.
 10. The personalized advertisement push method based on user interest learning according to claim 1, wherein extracting an object of interest in the video according to the user interest models comprises: receiving an input video stream, and detecting a representative key frame in content of the video stream; calculating a whole visual feature of the scene corresponding to the representative key frame according to bottom-layer visual features of macroblocks of the scene corresponding to the representative key frame; classifying the scene corresponding to the representative key frame into one of scene classifications which are classified in an establishing process of the user interest models according to the whole visual feature of the scene corresponding to the representative key frame; calculating an interest degree distribution diagram of the scene corresponding to the representative key frame according to the user interest models; and extracting an object with the highest interest degree from the interest degree distribution diagram.
 11. The personalized advertisement push method based on user interest learning according to claim 10, wherein calculating the interest degree distribution diagram of the scene corresponding to the representative key frame according to the user interest models comprises: utilizing the user interest models to infer sorting of candidate macroblocks in the scene corresponding to the representative key frame, and mapping the sorting to an interest degree of each candidate macroblock to obtain the interest degree distribution diagram of the scene corresponding to the representative key frame.
 12. The personalized advertisement push method based on user interest learning according to claim 10, wherein extracting the object with the highest interest degree from the interest degree distribution diagram comprises: determining a macroblock with the highest interest degree in the interest degree distribution diagram; and obtaining an area with a high interest degree from the macroblock by utilizing an area growth technology, and taking the area as the object of interest.
 13. A personalized advertisement push system based on user interest learning, wherein the system comprises: an interest model learning module, configured to obtain a plurality of user interest models through multitask sorting learning; an object of interest extraction module, configured to extract an object of interest in a video according to the user interest models; and an advertisement retrieval module, configured to extract multiple visual features of the object of interest, and retrieve related advertising information in an advertisement database according to the multiple visual features.
 14. The personalized advertisement push system based on user interest learning according to claim 13, wherein the interest model learning module comprises: a feature extraction submodule, configured to obtain various scenes and extract bottom-layer visual features of each macroblock in each scene; an initialization submodule, configured to randomly group users and the scenes into multiple classifications according to the bottom-layer visual features respectively, and initialize an interest model for each classification of the users on each classification of the scenes; an optimization submodule, configured to establish a loss function on a training set by using an initialized interest model, minimize the loss function through an optimization algorithm, and update a parameter value of each interest model and optimize classifications of the users and scenes; and a result obtaining submodule, configured to obtain final classifications of the users and the scenes, and a plurality of user interest models.
 15. The personalized advertisement push system based on user interest learning according to claim 13, wherein the object of interest extraction module comprises: a key frame detection submodule, configured to receive an input video stream and detect a representative key frame in content of the video stream; a feature calculation submodule, configured to calculate a whole visual feature of the scene corresponding to the representative key frame according to the bottom-layer visual features of macroblocks of the scene corresponding to the representative key frame; a scene classification submodule, configured to classify the scene corresponding to the representative key frame into one of scene classifications which are classified in an establishing process of the user interest models according to the whole visual feature of the scene corresponding to the representative key frame; an interest degree calculation submodule, configured to calculate an interest degree distribution diagram of the scene corresponding to the representative key frame according to the user interest models; and an area growth submodule, configured to obtain an area with the highest interest degree to serve as the object of interest through an area growth algorithm on the interest degree distribution diagram. 